#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=200;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
struct P{
    LL l,r;
}a[maxn];
LL tm[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    for(LL i=1;i<=n;i++) cin>>a[i].l>>a[i].r;
    for(LL i=1;i<=n;i++) cin>>tm[i];
    LL times=0;
    for(LL i=1;i<=n;i++){
        times+= (a[i].l-a[i-1].r)+tm[i];

        LL cnt=(a[i].r-a[i].l+2-1)/2;

        if(i!=n&&times>=a[i].r){
            times+=cnt;
        }
        else if(times<a[i].r&&i!=n){

            times+=cnt;
            times=max(times,a[i].r);
        }

      ///  debug(times);*/
    }
    cout<<times<<"\n";
  }
return 0;
}
